Oblivious Polynomial Evaluation
نویسندگان
چکیده
منابع مشابه
Oblivious Polynomial Evaluation
Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P , and a receiver whose input is a value α. At the end of the protocol the receiver learns P (α) and the sender learns nothing. We describe efficient constructions for this protocol, which are based on new intractability assumptions that are closely related to noisy polynomial reconstructi...
متن کاملOblivious Polynomial Evaluation and Oblivious Neural Learning
We study the problem of Oblivious Polynomial Evaluation (OPE), where one party has a polynomial P and the other party, with an input x, wants to learn P (x) in an oblivious way. Previously existing protocols are based on some intractability assumptions that have not been well studied [10, 9], and these protocols are only applicable for polynomials over finite fields. In this paper, we propose e...
متن کاملSecure Multiparty Overall Mean Computation via Oblivious Polynomial Evaluation
The number of opportunities for cooperative computation has exponentially been increasing with growing interaction via Internet technologies. Most of the time, the communicating parties may not want to disclose their private data to the other principal while taking the advantage of collaboration, hence concentrating on the results rather than private and perhaps useless data values. To conduct ...
متن کاملEfficient Oblivious Polynomial Evaluation with Simulation-Based Security
The study of secure multiparty computation has yielded powerful feasibility results showing that any efficient functionality can be securely computed in the presence of malicious adversaries. Despite this, there are few problems of specific interest for which we have highly efficient protocols that are secure in the presence of malicious adversaries under full simulation based definitions (foll...
متن کاملCryptanalysis on a novel unconditionally secure oblivious polynomial evaluation protocol
Vanishree et.al proposed a novel unconditionally oblivious polynomial evaluation protocol and they claimed that can fulfill both sender and receiver’s security. Here, this protocol is cryptanalyzed. We find that it has a fatal fault which cannot implement the receiver’s security at all and show the detail analyzing process. Keywords oblivious polynomial evaluation, oblivious transfer, multi-par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2006
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539704383633